Some Recent Advances in Network Flows
نویسندگان
چکیده
The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems. However, the surge of acti ty concerning the algorithmic aspects of network flow problems over the past few years has been particularly striking. Several tecnniques nave oven to De very successIul in permitting researchers to make these recent contributions: (i) scaling of the problem data; (ii) improved analysis of algorithms, especially amortized worstcase performance and the use of potential functions; and (iii) enhanced data structures. This survey illustrates some of these techniques and their usefulness in developing faster network flow algorithms. The discussion focuses on the design of faster algorithms from the worst-case perspective, and is limited to the following fundamental problems: the shortest path problem, the maximum flow problem, and the minimum cost flow problem. Several representative algorithms from each problem class are considered, including the radix heap algorithm for the shortest path problem, preflow push algorithms for the maximum flow problem, and the pseudoflow push algorithms for the minimum cost flow problem.
منابع مشابه
Effects of integrating physical and financial flows through a closed-loop supply chain network under uncertain demand and return
The impact of financial challenges on the profit of a supply chain, have caused the researcher to model the supply chain network by considering the operational and financial dimensions. Also, the establishment of a closed loop supply chain (CLSC) network has a high effect on economic profit. So, the purpose of this study is to design a stochastic closed loop supply chain network by considering ...
متن کاملRecent Advances in Network Flows
The present paper surveys important results in the theory of network flows which are not included in the book "Flows in Networks" by Ford and Fulkerson. The survey is divided into three areas: 1. Shortest paths and minimal cost flows, 2. Multi-terminal flows, 3. Multi-commodity flows.
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملSome recent advances in microlocal analysis
In this talk we describe some recent developments in microlocal analysis that have led to advances in understanding problems such as wave propagation, the Laplacian on asymptotically hyperbolic spaces and the meromorphic continuation of the dynamical zeta function for Anosov flows.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 33 شماره
صفحات -
تاریخ انتشار 1991